机载红外搜索跟踪系统

红外搜索和跟踪（ＩＲＳＴ） 系统是迅速探测红外威胁源的存在, 识别威胁源的种类,测定威胁源的方位并报警的一种光电系统。介绍了对机载ＩＲＳＴ的性能要求, 美国和欧洲等国对机载ＩＲＳＴ的研制及装备概况, 分析了今后机载ＩＲＳＴ系统的发展方向。     

一种RetinaNet与SE融合的航空取证目标检测算法

针对在开展航空侦察取证时缺乏自动化、智能化取证手段的情况,提出了一种基于Reti-naNet与SE融合的航空取证目标检测算法,解决目标尺度变化大、数据集中类别不均衡的问题,并通过SE (squeeze-excitations)模块引入注意力机制进一步改进性能.该改进算法中的特征金字塔网络FPN可有效应对目标尺寸变化较大...     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Technical note: Find a hidden “treasure”

This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λ_i (μ_i) for Player 1 (Player 2) such that p_i(1 ? exp(?λ_ix_i)) (p_i(1 ? exp(?μ_iy_i))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort x_i (y_i) applied at point i where p_i ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q₁ and Player 2 gets q₂ where q₁ + q₂ ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于动力学模型的有源假目标鉴别方法

针对导弹防御中可能出现的有源假目标欺骗干扰,从雷达数据处理的层次上进行了真假目标鉴别研究。利用自由段有源假目标与实体目标在动力学模型上的本质差异,提出了动力学模型匹配系数的概念,推导出理想条件下的动力学模型匹配系数的解析表达式。在弹道目标跟踪的基础上设计了有源假目标鉴别算法。结合中程弹道,进行了真假目标鉴别的计算机仿真实验。实验结果表明,所提算法能有效鉴别有源假目标。     

机动目标跟踪误差CRLB计算与分析

克拉美-罗下限(CRLB)作为参数估计所能达到的最低误差限,常被用来衡量算法估计性能的优劣程度。以转弯机动为例,研究了有源(主动)和无源(被动)两种观测条件下目标跟踪CRLB计算的一般方法,并通过矩阵理论分析了目标机动可能引起的CRLB突变的原因,为机动目标跟踪的算法性能评估提供了有效手段。最后给出了仿真算例。     

基于轮廓特征的空间目标识别算法

高分辨力单脉冲雷达通过对三个通道回波成像可以获取各个散射中心的方位角和俯仰角,结合距离信息就可以得到各个散射中心在垂直于雷达天线轴的平面上的投影,形成方位-俯仰二维像.由于卫星的尺寸通常大于碎片的尺寸,因此卫星的方位-俯仰二维像的轮廓面积较大.提出了基于轮廓特征的空间目标识别算法,首先通过高分辨力单脉冲雷达对目标进行方位-俯仰二维像成像,然后从方位-俯仰二维像中提取目标轮廓,最后根据轮廓面积特征对卫星和碎片进行识别.经过计算机仿真实验,该算法取得了比较好的识别效果.     

防空导弹对目标拦截的模糊二元对比排序

确定对空袭兵器的拦截次序是防空导弹火力分配的重要内容.定性分析和定量计算相结合,利用模糊数学中的模糊二元对比排序法确定防空导弹对多个目标拦截的优先次序,先对模型进行描述,给出模糊相似关系矩阵及相应的计算方法,再以4种空袭兵器为作战对象,运用模型进行计算,得出直观的目标拦截排序结果,变模糊的、复杂的问题为直观的结论.为指挥员科学分配防空火力,最大限度地发挥防空导弹的制空效能奠定基础.